Closed 2-cell embeddings of 4 cross-cap embeddable graphs

نویسنده

  • Xiaoya Zha
چکیده

The strong embedding conjecture states that every 2-connected graph has a closed 2-cell embedding in some surface , i . e . an embedding that each face is bounded by a circuit in the graph . A graph is called k -crosscap embeddable if it can be embedded in the surface of non-orientable genus k . We confirm the strong embedding conjecture for 5-crosscap embeddable graphs . As a corollary , every such graph has a cycle double cover , i . e . a set of circuits containing every edge exactly twice . We classify simple closed curves in the surface of 3-crosscap graphs and study some topological properties of simple closed curves in the torus and the punctured torus .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The maximum genus of vertex-transitive graphs

Graphs possessing a high degree of symmetry have often been considered in topological graph theory. For instance, a number of constructions of genus embeddings by means of current or voltage graphs is based on the observation that a graph can be represented as a Cayley graph for some group. Another kind of embedding problems where symmetrical graphs are encountered is connected with regular map...

متن کامل

Linkless and Flat Embeddings in 3-space in Quadratic Time

We consider embeddings of graphs in the 3-space R (all embeddings inthis paper are assumed to be piecewise linear). An embbeding of a graph in R3 is linkless if every pair of disjoint cycles forms a trivial link (in the senseof knot theory), i.e., each of the two cycles (in R) can be embedded in aclosed topological 2-disk disjoint from the other cycle. Robertson, Seymour and...

متن کامل

Orientable embeddings and orientable cycle double covers of projective-planar graphs

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected proje...

متن کامل

Full-symmetric Embeddings of Graphs on Closed Surfaces

Every 2-cell embedding of a graph G on a closed surface F 2 admits a group action of autohomeomorphisms of F 2 of order at most 4 ∣∣E(G)∣∣. The embedding of G is full-symmetric if G attains the upper bound for the order. We shall discuss on such full-symmetric embeddings and classify those on the projective plane, the torus and the Klein bottle.

متن کامل

Shortest Path Embeddings of Graphs on Surfaces

The classical theorem of Fáry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of Fáry’s theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 162  شماره 

صفحات  -

تاریخ انتشار 1996